#include "QuickSort.h"
int main()
{
	int a[10] = { 3,1,2,5,4,6,9,7,10,8 };
	QuickSort(a, 0, sizeof(a) / sizeof(int) - 1);
	int n = sizeof(a) / sizeof(int);
	int i = 0;
	for (int i = 0; i < n; i++)
	{
		printf("%d ", a[i]);
	}
	printf("\n");
	return 0;
}